posm

#defineLS l,m,rt4 #defineRS M+1,r,rt5 #defineF (I,A,B) for (int i=a;i6 using namespacestd;7 8 Const intn=1e5+7;9 intcol[n*Ten];Tenvectorint>cnt[n*Ten]; One intt,n,q; A structnode{intL,r,val;} tr[n*4]; - - voidUpintRT) the { -tr[rt].l=tr[rt1].L; -tr[rt].r=tr[rt1|1].R; -tr[rt].val=tr[rt1].val+tr[rt1|1].val; + if(tr[rt1].r==tr[rt1|1].L) tr[rt].val--; - } + A voidBuildintL=1,intR=n,intrt=1) at { - if(l==R) - { -scanf"%d",tr[rt].l); -Tr[rt].r=tr[rt].l,tr[rt].val=1; - CNT[TR[RT].L].PB (

2"Sample Output"969396/*segment Tree Maintenance maximum Note that n here can be the number of queries, because n is the maximum number of queries*/#include#include#defineM 200010#defineLson l,m,now*2#defineRson m+1,r,now*2+1#defineLL Long Longusing namespacestd; LL mx[m*4],mod,t=0, N; LL Read () {CharC=getchar (); LL num=0, flag=1; while(c'0'|| C>'9'){if(c=='-') flag=-1; c=GetChar ();} while(c>='0'c'9') {num=num*Ten+c-'0'; c=GetChar ();} returnnum*Flag;}voidPUSH_UP (intNow ) {Mx[now]=max (mx

algorithm. Hey, there is a topic to say (0Every time you do a problem, you have to think about it, the border,D=0 alone with the greedy method of calculation, in fact, do not have to,.Code:int ConstN =100005;intA[n], f[n];intf[n2];intn,d;voidPushup (intRT) {F[rt]=max (f[rt1],f[rt1|1] ); return;}voidBuildintLintRintRT) { if(l==R) {F[rt]=0; return; } intM= (l+r) >>1; Build (Lson); Build (Rson); Pushup (RT);}voidUpdateintPosintXintLintRintRT) { if(l==S) {F[rt]=Max (f[rt],x); return;

Topic Connection: http://acm.hdu.edu.cn/showproblem.php?pid=1394Segment Tree function: Update: Single point of increase or decrease query: interval sumAnalysis: If the arrangement is 0 to n-1, then if the first number is put to the last, for this series, the reverse number is reduced a[i], and increase n-1-a[i], so each change to res+=n-a[i]-1-a[i].#include #include#include#include#defineLL Long Long#defineMAXN 5555#defineLson l,m,rt#defineRson m+1,r,rtusing namespacestd;intsum[maxn2];intA[MAXN]

=1e5;7 intA[n],n,g[n],v[n],nxt[n],ed,x,tot,root[n],dfn[n],dfs_idx,sz[n],mid[n],val[n];8 ll Sum[n],ans,mx;9 TenInlinevoidAdgintXintY) {v[++ed]=y,nxt[ed]=g[x],g[x]=Ed;} One voidInit () {ed=tot=dfs_idx=0, ans=mx=0; memset (SUM,0,sizeof(sum)); Memset (G,0,sizeof(g));} AInlinevoidUpmax (ll a,ll b) {if(ab;} - //------------------A tree-like array -InlinevoidAddintXintc) { while(xx;} theinline LL Ask (intx) {ll an=0; while(x) an+=sum[x],x-=x-x;returnan ;} - //------------------Chairman Tree - structnod

; - intM=l+r>>1; the if(posm) update (T[X].L,T[Y].L,POS,VAL,L,M); - ElseUpdate (t[x].r,t[y].r,pos,val,m+1, R); - } - + intQueryintXintKintL=1,intR=N) - { + if(L==R)returnl; A intM=l+r>>1; at if(kreturnquery (t[x].l,k,l,m); - returnQuery (t[x].r,k-t[t[x].l].sum,m+1, R); - } - - intGetsum (intXintLintRintL=1,intR=N) - { in if(Lreturnt[x].sum; - intM=l+r>>1, ans=0; to if(lgetsum (t[x].l,l,r,l,m); + if(r>m) An

Topic Connection: http://acm.hdu.edu.cn/showproblem.php?pid=1754Segment tree feature: Update: Single point replace query: Interval maxTemplate Bare Title ...#pragmaComment (linker, "/stack:102400000,102400000")#include#include#includestring>#include#include#include#include#include#include#include#includeSet>#include#defineLL Long Long#defineMoD 1000000007#defineINF 0x3f3f3f3f#defineN 200010#defineFILL (A, B) (Memset (A,b,sizeof (a)))#defineLson l,m,rt#defineRson m+1,r,rtusing namespacestd;intmx[

Topic Connection: http://acm.hdu.edu.cn/showproblem.php?pid=1166Segment Tree function: Update: Single point of increase or decrease query: interval sum#pragmaComment (linker, "/stack:102400000,102400000")#include#include#includestring>#include#include#include#include#include#include#include#includeSet>#include#defineLL Long Long#defineMoD 1000000007#defineINF 0x3f3f3f3f#defineN 50010#defineFILL (A, B) (Memset (A,b,sizeof (a)))#defineLson l,m,rt#defineRson m+1,r,rtusing namespacestd;intsum[n2];in

; Build (Lson); Build (Rson);}voidUpdateintPosintNumintLintRintRT) { if(l==R) {Maxv[rt]=Max (maxv[rt],num); return; } intM= (l+r) >>1; if(posm) update (Pos,num,lson); ElseUpdate (Pos,num,rson); Pushup (RT);}intQueryintLintRintLintRintRT) { if(lR) { returnMaxv[rt]; } intM= (l+r) >>1; intans=0; if(lMax (Ans,query (L,r,lson)); if(r>m) ans=Max (Ans,query (L,r,rson)); returnans;}intMain () {intn,d; while(~SCANF ("%d%d",n,d)) {

(Son[rt]) connect (SON[RT],ANC); the for(inti = head[rt];i!=-1; i =e[i].next) - if(e[i].v!=fa[rt]e[i].v!=Son[rt])Wuyi Connect (E[I].V,E[I].V); the } - voidPushup (intRT) Wu { -SUM[RT] = sum[rt1]+sum[rt1|1]; About } $ voidUpdateintPosintValintLintRintRT) - { - if(l==R) { -SUM[RT] =Val; A return; + } the intm = (l+r) >>1; - if(posm) update (Pos,val,lson); $ ElseUpdate (Pos,val,rson); the pushup (RT); the } the in

].en =e[i].v; +Find_heavy (e[i].v,rt,depth+1); Asiz[rt]+=SIZ[E[I].V]; the if(siz[e[i].v]>maxsize) +MaxSize = Siz[e[i].v],son[rt] =e[i].v; - } $ } $ voidPushup (intRT) - { -SUM[RT] = max (sum[rt1],sum[rt1|1]); the } - voidUpdateintPosintValintLintRintRT)Wuyi { the if(l==R) { -SUM[RT] =Val; Wu return; - } About intm = (l+r) >>1; $ if(posm) update (Pos,val,lson); - ElseUpdate (Pos,val,rson); - pushup (RT); - } A vo

("Unroll-loops")#include #defineFi first#defineSe Second#defineMP Make_pair#definePB Push_back#definePi ACOs (-1.0)#definell Long Long#defineMoD 1000000007#defineC 0.5772156649#defineLS l,m,rt#defineRS M+1,r,rt#definePiL pair#definePLI pair#definePII pair#defineCD complex#defineull unsigned long Long#defineBase 1000000000000000000#defineFio Ios::sync_with_stdio (false); Cin.tie (0)using namespacestd;Const Doubleg=10.0, eps=1e- A;Const intn=200000+Ten, maxn=8000000+Ten, inf=0x3f3f3f3f, inf=0x3f3